package org.example.Soution003;

public class MDDPMinRouteAddition {
    public static void main(String[] args) {
        int[][] grid=new int[][]{{1},{1},{4}};
        MDDPMinRouteAddition mddp=new MDDPMinRouteAddition();
        System.out.println(mddp.minPathSum(grid));
    }

    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = grid[0][0];
        if (m == 1 && n == 1) return dp[0][0];
        for (int i = 1; i < m; i++) {
            dp[i][0] = dp[i-1][0] + grid[i][0];
        }
        if (n == 1) return dp[m-1][0];
        for (int j = 1; j < n; j++) {
            dp[0][j] = dp[0][j-1] + grid[0][j];
        }
        if (m == 1) return dp[0][n-1];
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
            }
        }
        return dp[m-1][n-1];
    }
}
